EAGLE does Space Efficient LTL Monitoring

We briefly present a rule-based framework, called EAGLE, that has been shown to be capable of defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time and metric temporal logics (MTL), interval logics, forms of quantified temporal logics, and so on. In this paper we show how EAGLE can perform linear temporal logic (LTL) monitoring in an efficient way. For an initial formula of size m, we establish upper bounds of O(m22m logm) and O(m422m log2 m) for the space and time complexity, respectively, of single step evaluation over an input trace. This bound is close to the lower bound O(2 √ m) for future-time LTL presented in [16]. EAGLE has been successfully used, in both LTL and metric LTL forms, to test a real-time controller of an experimental NASA planetary rover. Copyright c © 2003, University of Manchester. All rights reserved. Reproduction (electronically or by other means) of all or part of this work is permitted for educational or research purposes only, on condition that no commercial gain is involved. Recent preprints issued by the Department of Computer Science, Manchester University, are available on WWW via URL http://www.cs.man.ac.uk/preprints/index.html or by ftp from ftp.cs.man.ac.uk in the directory pub/preprints. This author is most grateful to RIACS/USRA and to the UK’s EPSRC under grant GR/S40435/01 for the partial support provided to conduct this research. This author is grateful for the support received from RIACS to undertake this research while participating in the Summer Student Research Program at the NASA Ames Research Center.